Scheduling Complete Intrees on Two Uniform Processors with Communication Delays
نویسندگان
چکیده
In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
منابع مشابه
Scheduling tree-structured programs in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimum-length schedules for treestructured programs in the LogP model. This problem is proved to be NP-hard, even for outtrees of height two in LogP models with an...
متن کاملScheduling in and Out Forests in the Presence of Communication Delays
We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain cost-measures (such as the computation time) are minimized. Several cases of the scheduling prob...
متن کاملScheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملScheduling UET, UCT dags with release dates and deadlines
The problem of scheduling precedence graphs for which every task has to be executed in a non-uniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that nds minimumlateness schedules. 1. Outforests on two processors. 2. Series-parallel graphs and opposing forests with the least urgent parent prope...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 58 شماره
صفحات -
تاریخ انتشار 1996